Ensemble Trapping Set Enumerators for Protograph-Based LDPC Codes
نویسندگان
چکیده
Protograph-based LDPC codes have the advantages of a simple design (or search) procedure and highly structured encoders and decoders. Recently, techniques for finding asymptotic trapping set enumerators in regular and irregular LDPC code ensembles was published [1]. In this paper, finite-length ensemble trapping set enumerators for protographbased LDPC codes are obtained. The asymptotic results are derived from the finite-length results by letting the block length go to infinity. The asymptotic results allow us to determine whether or not the typical smallest trapping set size grows linearly with codeword length.
منابع مشابه
Protograph-Based Generalized LDPC Codes: Enumerators, Design, and Applications
Among the recent advances in the area of low-density parity-check (LDPC) codes, protograph-based LDPC codes have the advantages of a simple design procedure and highly structured encoders and decoders. These advantages can also be exploited in the design of protograph-based generalized LDPC (G-LDPC) codes. In this dissertation we provide analytical tools which aid the design of protographbased ...
متن کاملAn Unnoticed Strong Connection Between Algebraic-Based and Protograph-Based LDPC Codes, Part II: Nonbinary Case and Code Construction
This paper is the second part of a series of two papers on the investigation of the connection between two methods for constructing LDPC codes, namely the superposition and the protograph-based methods. In the first part, by taking the graph point of view, we established a strong connection between these two construction methods and showed that, in the binary case, the protograph-based construc...
متن کاملOn the Tanner Graph Cycle Distribution of Random LDPC, Random Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles
Random bipartite graphs, random lifts of bipartite protographs, and random cyclic lifts of bipartite protographs are used to represent random low-density parity-check (LDPC) codes, randomly constructed protograph-based LDPC codes, and random quasi-cyclic (QC) LDPC codes, respectively. In this paper, we study the distribution of cycles of different length in all these three categories of graphs....
متن کاملSpatially Coupled Protograph-Based LDPC Codes for Decode-and-Forward in Erasure Relay Channel
We consider spatially-coupled protograph-based LDPC codes for the three terminal erasure relay channel. It is observed that BP threshold value, the maximal erasure probability of the channel for which decoding error probability converges to zero, of spatially-coupled codes, in particular spatially-coupled MacKay-Neal code, is close to the theoretical limit for the relay channel. Empirical resul...
متن کاملPerformance Analysis of Protograph-based LDPC Codes with Spatial Diversity
In wireless communications, spatial diversity techniques, such as space-time block code (STBC) and single-input multiple-output (SIMO), are employed to strengthen the robustness of the transmitted signal against channel fading. This paper studies the performance of protograph-based low-density parity-check (LDPC) codes with receive antenna diversity. We first propose a modified version of the p...
متن کامل